| 1. | A fast adaptive routing algorithm based on delay
快速自适应路由算法 |
| 2. | Research of rationally adaptive routing based on ant colony algorithms
基于蚁群算法的理性自适应路由研究 |
| 3. | Adaptive routing algorithm
自适应路径选择算法 |
| 4. | The dissertation proposes an adaptive route optimization method to resolve the problem . if length of the session
该方法根据用户之间的会话长度来确定优化策略。 |
| 5. | With consideration of both performance and cost , a fully - adaptive routing model system on 2d - mesh is designed and we have realized the model system of 16 nodes
通过在性能、代价和易实现方面进行合理折衷，设计了一个简洁高效的完全自适应路由器。 |
| 6. | 3 . the multiple qos adaptive routing algorithm has been proposed . it can refresh the router table by the previous delay information to find a suitable path with the constraints of the bandwidth and the delay - jitter
该算法直接利用前一周期的时延信息来更新路由表，以作为当前寻找路径的依据，在满足带宽和时延波动约束条件下，使数据传送过程时延最小化。 |
| 7. | The main contents of this thesis are as follows : 1 . this thesis reviews the principles , development and the present state of routing protocol , adaptive routing and multiple qos routing algorithms , and briefly discusses the future trend in qos routing algorithms . 2
通过阅读大量的中英文文献，对路由协议、自适应路由、多qos路由等基本概念和原理作了比较系统而完整的阐述；同时分析了当前国内外对多qos路由算法的研究现状以及未来发展趋势。 |
| 8. | After analyzing a common used ant colony routing algorithm , this thesis proposed a new fast adaptive routing algorithm to overcome the drawbacks of the ant - based algorithm . the new algorithm uses network delay information directly to choose path by probability . its application will minimize the delay for an end - to - end data transmission and optimize the distribution of network resources to avoid network congestion
算法能够凭借路径时延信息并结合网络中各路径的利用率情况自适应的调整发送路径，并以概率的形式选择路径，一方面尽可能地使端到端数据传送过程时延最小化，另一方面使网络流量分布均匀，以减少网络拥塞发生的概率。 |
| 9. | For the sake of prolonging the lifespan of nodes and improving the performance of stable and routing , a self - adaptive routing algorithm based on analytic hierarchy process ( ahp ) is proposed . the new algorithm induces ahp to cluster self - adaptively , and then it makes virtual backbone network by clusters and sinks , after that it creates routes in the virtual backbone network
仿真实验表明新算法较flooding节能,能较好的克服flooding算法中报文冗余度高、能耗大等不足。为了尽可能地延长节点的生存期限,提高网络的稳定性与路由性能,提出了一种基于层次分析法的自适应分簇路由算法。 |
